Geographic Routing in 3D
نویسندگان
چکیده
Existing geographic routing algorithms assume a two-dimensional topology. Dedicated wireless sensor network scenarios demand for algorithms that operate in three-dimensional environments. This paper discusses issues which arise when making the step from 2D to 3D. Simulation studies show that 3D routing is less efficient than its 2D counterpart when comparing topologies with the same average node degree.
منابع مشابه
Geographic and Clustering Routing for Energy Saving in Wireless Sensor Network with Pair of Node Groups
Recently, wireless sensor network (WSN) is the popular scope of research. It uses too many applications such as military and non-military. WSN is a base of the Internet of Things (IoT), pervasive computing. It consists of many nodes which are deployed in a specific filed for sense and forward data to the destination node. Routing in WSN is a very important issue because of the limitation of the...
متن کاملdesigning and implementing a 3D indoor navigation web application
During the recent years, the need arises for indoor navigation systems for guidance of a client in natural hazards and fire, due to the fact that human settlements have been complicating. This research paper aims to design and implement a visual indoor navigation web application. The designed system processes CityGML data model automatically and then, extracts semantic, topologic and geometric...
متن کاملGeographic Routing with Low Stretch in d - dimensional Spaces ∗
Geographic routing is attractive because the routing state needed per node is independent of network size. We present a novel geographic routing protocol with several major advances over previous geographic protocols. First, our protocol achieves an average routing stretch close to 1. Second, our protocol can be used for nodes located in d-dimensional Euclidean spaces (d ≥ 2). Third, node locat...
متن کاملDelivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks
In this paper, we investigate how to design greedy routing to guarantee packet delivery in a three-dimensional (3D) network. In 2D networks, many position-based routing protocols apply face routing on planar routing structure as a backup method to guarantee packet delivery when greedy routing fails at local minimum. However, in 3D networks, no planar topology can be constructed anymore. Even wo...
متن کاملThree-dimensional greedy routing in large-scale random wireless sensor networks
In this paper, we investigate how to design greedy routing to achieve sustainable and scalable in a large-scale three-dimensional (3D) sensor network. Several 3D position-based routing protocols were proposed to seek either delivery guarantee or energy-efficiency in 3D wireless networks. However, recent results [1,2] showed that there is no deterministic localized routing algorithm that guarant...
متن کامل